Complexity classes - PDFSEARCH.IO - Document Search Engine

Complexity classes
Results: 1120

#	Item
341	Unprovable Security of Two-Message Zero Knowledge Kai-Min Chung∗ Edward Lui∗ Mohammad Mahmoody∗ Rafael Pass∗ December 19, 2012 Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2012-12-19 11:29:49 Complexity classes Cryptographic protocols Probabilistic complexity theory Interactive proof system Probabilistically checkable proof IP Soundness Zero-knowledge proof Time complexity Theoretical computer science Computational complexity theory Applied mathematics
342	Parameterized Complexity for the Database Theorist Martin Grohe Division of Informatics, University of Edinburgh, Edinburgh EH9 3JZ, Scotland, UK. Email: 1 . Introduction Add to Reading List Source URL: homepages.inf.ed.ac.uk Language: English - Date: 2006-07-04 06:02:43 NP-complete problems Analysis of algorithms Complexity classes Parameterized complexity Graph coloring Dominating set FO Time complexity Tree decomposition Theoretical computer science Computational complexity theory Applied mathematics
343	Noname manuscript No. (will be inserted by the editor) Certain Answers over Incomplete XML Documents: Extending Tractability Boundary Add to Reading List Source URL: homepages.inf.ed.ac.uk Language: English - Date: 2014-11-26 07:55:10 Conjunctive query Database theory Relational model Complexity classes Model theory Null Data integration SQL FO Data management Computing Mathematics
344	Survey on Cryptographic Obfuscation M´at´e Horv´ath∗ Laboratory of Cryptography and System Security (CrySyS Lab)† April 24, 2015 Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2015-04-24 07:02:48 Complexity classes Obfuscation Circuit complexity Obfuscated code Ciphertext indistinguishability International Obfuscated C Code Contest NC Semantic security Multilinear map Theoretical computer science Computer programming Computational complexity theory
345	On the Complexity of Query Answering over Incomplete XML Documents Amelie ´ Gheerbrant Leonid Libkin Add to Reading List Source URL: homepages.inf.ed.ac.uk Language: English - Date: 2012-04-04 06:15:23 Complexity classes Conjunctive query Database theory Relational model Data integration FO Relational algebra Lowest common ancestor SQL Computing Theoretical computer science Data management
346	Curriculum Vitae of Uriel Feige Contact Information Department of Computer Science and Applied Mathematics The Weizmann Institute of Science Rehovot 76100, ISRAEL Phones (office), (cell) Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2015-01-01 11:38:31 Computational complexity theory Complexity classes Approximation algorithm NP-complete ACM SIGACT European Symposium on Algorithms International Colloquium on Automata Languages and Programming Uriel Feige Algorithm Theoretical computer science Applied mathematics Computer science
347	Reasoning About Pattern-Based XML Queries Am´elie Gheerbrant1, Leonid Libkin1, and Cristina Sirangelo2 1 School of Informatics, University of Edinburgh 2 Add to Reading List Source URL: homepages.inf.ed.ac.uk Language: English - Date: 2013-06-07 12:18:52 Conjunctive query Database theory Complexity classes Relational model Structure Data integration Symbol FO Boolean satisfiability problem Theoretical computer science Mathematics Data management
348	Efficient Approximations of Conjunctive Queries Pablo Barcelo Leonid Libkin Miguel Romero Add to Reading List Source URL: homepages.inf.ed.ac.uk Language: English - Date: 2012-04-04 06:16:46 Database theory Tree decomposition Hypergraph Hypercube graph Bipartite graph FO Directed graph Decomposition method Path decomposition Graph theory Complexity classes Conjunctive query
349	Constant-Round Concurrent Zero-knowledge from Indistinguishability Obfuscation Kai-Min Chung∗ Huijia Lin† Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2014-12-18 08:37:34 Complexity classes Cryptographic protocols Zero-knowledge proof Interactive proof system Soundness NP IP Commitment scheme P/poly Theoretical computer science Computational complexity theory Cryptography
350	Chapter 5: Hard Problems Quotation Algorithmic Adventures From Knowledge to Magic Add to Reading List Source URL: www.win.tue.nl Language: English - Date: 2011-10-24 15:11:43 Complexity classes Dynamic programming NP-complete problems Operations research P versus NP problem Time complexity Knapsack problem P Subset sum problem Theoretical computer science Computational complexity theory Applied mathematics

UPDATE